AN AUTOMATED ALGORITHM FOR APPROXIMATION OF TEMPORAL VIDEO DATA USING LINEAR B´EZIER FITTING
نویسندگان
چکیده
منابع مشابه
An Automated Algorithm for Approximation of Temporal Video Data Using Linear B'EZIER Fitting
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the intensity variations of each pixel in temporal dimension using linear Bezier fitting in Euclidean space. Fitting of each segment ensures upper bound of specified mean squared error. Break and fit criteria is employed to m...
متن کاملLinear-time geometric algorithm for evaluating B\'ezier curves
New algorithm for evaluating a point on a Bézier curve and on a rational Bézier curve is given. The method has a geometric interpretation and a convex hull property. The computational complexity of the new algorithm is linear with respect to the degree of the considered curve, and its memory complexity is O(1).
متن کاملMetamorphosis Using B Ezier Clipping
Recently, in the eld of entertainment, the metamorphosis of 2-D images, as it is an attractive technique, has come to be used in movies and television commercials. This technique is referred to as morphing. In the proposed method, B ezier or B-spline nets are overlapped onto digital images, and their deformation is performed by moving the control points of the nets on the images. The method pro...
متن کاملAn Approximation Algorithm for l∞-Fitting Robinson Structures to Distances
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l∞-error ||d−dR||∞ = maxx,y∈X{|d(x, y)− dR(x, y)|}. A distance dR on a finite set X is Robinsonian if its matrix can be symmetrically permuted so that its elements do not decrease when mov...
متن کاملAn Approximation Algorithm for linfinity Fitting Robinson Structures to Distances
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l∞-error ||d−dR||∞ = maxx,y∈X{|d(x, y)− dR(x, y)|}. A distance dR on a finite set X is Robinsonian if its matrix can be symmetrically permuted so that its elements do not decrease when mov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International journal of Multimedia & Its Applications
سال: 2010
ISSN: 0975-5934
DOI: 10.5121/ijma.2010.2207